On three approaches to conjugacy in semigroups
نویسندگان
چکیده
We compare three approaches to the notion of conjugacy for semigroups, the first one via the transitive closure of the uv ∼ vu relation, the second one via an action of inverse semigroups on themselves by partial transformations, and the third one via characters of finitedimensional representations.
منابع مشابه
Conjugation in Semigroups
The action of any group on itself by conjugation and the corresponding conjugacy relation play an important role in group theory. There have been several attempts to extend the notion of conjugacy to semigroups. In this paper, we present a new definition of conjugacy that can be applied to an arbitrary semigroup and it does not reduce to the universal relation in semigroups with a zero. We comp...
متن کاملConjugacy in Semigroups
The action of any group on itself by conjugation and the corresponding conjugacy relation play an important role in group theory. There have been several attempts to extend the notion of conjugacy to semigroups. In this paper we present a new definition of conjugacy, which can be applied to an arbitrary semigroup, including semigroups with zero. We characterize this conjugacy in various semigro...
متن کاملOn the Graphs Related to Green Relations of Finite Semigroups
In this paper we develop an analog of the notion of the con- jugacy graph of nite groups for the nite semigroups by considering the Green relations of a nite semigroup. More precisely, by de ning the new graphs $Gamma_{L}(S)$, $Gamma_{H}(S)$, $Gamma_{J}(S)$ and $Gamma_{D}(S)$ (we name them the Green graphs) related to the Green relations L R J H and D of a nite semigroup S , we first atte...
متن کاملOn conjugacy in regular epigroups
Let S be a semigroup. The elements a, b ∈ S are called primarily conjugate if a = xy and b = yx for certain x, y ∈ S. The relation of conjugacy is defined as the transitive closure of the relation of primary conjugacy. In the case when S is a monoid, denote by G the group of units of S. Then the relation of G-conjugacy is defined by a ∼G b ⇐⇒ a = gbg for certain g ∈ G. We establish the structur...
متن کاملA Solvable Conjugacy Problem for Finitely Presented C(3) Semigroups
In his thesis, Remmers [R], introduced semigroup derivation diagrams and used them to prove that the word problem for finitely presented C(3) semigroups was solvable. In this article we introduce the annular analog of semigroup derivation diagrams and use them to demonstrate the solution to a conjugacy problem for finitely presented C(3) semigroups. Version of 5-21-2013
متن کامل